Lattice-like Total Perfect Codes
نویسندگان
چکیده
A contribution is made to the classification of lattice-like total perfect codes in integer lattices Λn via pairs (G,Φ) formed by abelian groups G and homomorphisms Φ : Z → G. A conjecture is posed that the cited contribution covers all possible cases. A related conjecture on the unfinished work on open problems on lattice-like perfect dominating sets in Λn with induced components that are parallel paths of length > 1 is posed as well.
منابع مشابه
Discussiones Mathematicae Lattice-like Total Perfect Codes Contribution Covers All Possible Cases. a Related Conjecture on the Unfinished Work on Open Problems on Lattice-like Perfect Dominating Sets in Λ N With
13 A contribution is made to the classification of lattice-like total perfect 14 codes in integer lattices Λn via pairs (G,Φ) formed by abelian groups G 15 and homomorphisms Φ : Z → G. A conjecture is posed that the cited 16 contribution covers all possible cases. A related conjecture on the unfinished 17 work on open problems on lattice-like perfect dominating sets in Λn with 18 induced compon...
متن کاملPerfect domination in regular grid graphs
We show there is an uncountable number of parallel total perfect codes in the integer lattice graph Λ of R. In contrast, there is just one 1-perfect code in Λ and one total perfect code in Λ restricting to total perfect codes of rectangular grid graphs (yielding an asymmetric, Penrose, tiling of the plane). We characterize all cycle products Cm × Cn with parallel total perfect codes, and the d-...
متن کاملPerfect domination in rectangular grid graphs
A dominating set S in a graph G is said to be perfect if every vertex of G not in S is adjacent to just one vertex of S. Given a vertex subset S of a side Pm of an m×n grid graph G, the perfect dominating sets S in G with S = S ∩ V (Pm) can be determined via an exhaustive algorithm Θ of running time O(2m+n). Extending Θ to infinite grid graphs of width m − 1, periodicity makes the binary decisi...
متن کاملTotal perfect codes, OO-irredundant and total subdivision in graphs
Let $G=(V(G),E(G))$ be a graph, $gamma_t(G)$. Let $ooir(G)$ be the total domination and OO-irredundance number of $G$, respectively. A total dominating set $S$ of $G$ is called a $textit{total perfect code}$ if every vertex in $V(G)$ is adjacent to exactly one vertex of $S$. In this paper, we show that if $G$ has a total perfect code, then $gamma_t(G)=ooir(G)$. As a consequence, ...
متن کاملA generalization of Lee codes
Motivated by a problem in computer architecture we introduce a notion of the perfect distance-dominating set, PDDS, in a graph. PDDS s constitute a generalization of perfect Lee codes, diameter perfect codes, as well as other codes and dominating sets. In this paper we initiate a systematic study of PDDS s. PDDS s related to the application will be constructed and the non-existence of some PDDS...
متن کامل